2017

Unit-1

1. Solve Following
2. Define the following:
   1. Data Structure
   2. Algorithm
   3. Program
   4. Space Complexity
3. Discuss various algorithmic notation. Also explain what do you mean by problem solving ? 4×2=8
4. Solve
5. Write a short note on time complexity and space complexity of an algorithm. 8
6. Explain the use of data structure. How is it helpful ? 7

Unit II

1. Solve

2. what do you mean by one-dimensional array ? Explain with example. 3

3. How can you access the elements of 1-D array and store them ? 4
4. Explain how the insertion and deletion operations are performed on an 1-D array ? 6

5. What do you mean by string ? 2

6. Solve

7. Write short notes on: 8

   (i) Stack

   (ii) Queue

8. Explain the operations that can be performed on stack as well as queue. 7

Unit - III

1. Solve

2. Define the following: 4

   (i) Linear data structure
   
   (ii) Non-linear data structure
   
   (iii) Pointer
   
   (iv) Linked list
   

3. Write a program and explain it that how an element can be inserted and deleted in a singly linked list. 11

4. Solve

   (a) What do you mean by linked storage representation ? 2

   (b) What are the applications of a linked list ? 6

   © Write a program segment to traverse the least element of a singly linked list. 7

Unit - IV

1. Solve
2. Define with example the following data structures: 4
   1. Tree
   2. Any one type of tree
   3. What do you mean by height balanced tree ? Explain with an example. 4
   4. Insert the following numbers in an AVL tree : 15, 22, 8, 63, 28, 72, 82, 89, 95.
3. Solve
4. What do you mean by Graph in data structure ? Give examples. 2
5. Differentiate between graph and tree. 2
6. Explain the two types of graph traversal with example. 8
7. What is the use of graph in data structure ? Give an example. 2
8. What is an edge and vertex in graph ? 1

Unit -V

1. Solve Following
2. What do you mean by sorting ? 1
3. Write short notes on any two with example : 2×5=10
4. Quick sort
5. Bubble sort
6. Merge sort
7. Write an algorithm for merge sort. 4
8. Solve
9. Explain the concept of binary search with an example. 8
10. Write an algorithm to search an element in an array using linear search algorithm. 5
11. Differentiate between linear search and library search. 2

2016

Unit-I

1. Solve Following
2. What do you understand by data structure? What are the types of data structure? List out the areas in which data structure are applied extensively.
3. Explain the various aspects of problem solving in detail. Also, discuss pros and cons of each. 8+7
4. Solve Following
5. What is an algorithm? Explain briefly about the sequence of steps involve in designing and analysis of algorithm.
6. Explain time and space complexity of an algorithm. 10+5

Unit-II

1. Solve Following
2. What is meant by one-dimensional array? Discuss how the elements Of 1-D array are stored and access.
3. Write an algorithm to find maximum and minimum values of number stored in 2-D array. 8+7
4. Solve Following
5. What do you mean by stack? Differentiate between array and stack. Write down the procedure for implementing various stack operation.
6. What is a Queue? What are the drawbacks of linear queue? 10+5

Unit-III

1. Solve Following
2. What is a linked list? What are its applications? Explain with an example cursor implementation of linked list.
3. Write an algorithm to insert an element into a linked list. 10+5
4. Explain with suitable program segments any four operations of linked list. 15

Unit-IV

1. Solve Following
2. What do you mean by tree? Define types of tree in detail.
3. Insert the following data types in an AVL tree: 16, 23, 9, 64, 29, 73, 83, 90, 96. [8+7]
4. Solve Following
5. What do you mean by graph data structure? Explain sequential and linked list implementation of graph data structure.
6. Define the graph traversal in better ? Explain depth first search traversal . [8+7]

Unit-V

1. Write short notes on:
2. selection sort
3. Quick sort
4. Merge sort
5. Solve Following
6. Write algorithm for bubble sort. Sort the following list 73, 49, 53, 12, 48, 10, 70, 20.
7. Explain binary search tree with an example. [8+7]

2016(BCA)

Unit-I

1. Solve Following

2. What do you understand by data structure? What are the types of data structure? List out the areas in which data structure are applied extensively. [8]

Answer :

A data structure is basically a group of data elements that are put together under one name, and which defines a particular way of storing and organizing data in a computer so that it can be used efficiently.

Data structures are used in almost every program or software system.

Some common examples of data structures are arrays, linked lists, queues, stacks, binary trees, and hash tables.

Data structures are building blocks of a program. A program built using improper data structures may not work as expected. So as a programmer it is mandatory to choose most appropriate data structures for a program.

The term data means a value or set of values. It specifies either the value of a variable or a constant (e.g., marks of students, name of an employee, address of a customer, value of pi, etc.).

A record is a collection of data items. For example, the name, address, course, and marks obtained are individual data items. But all these data items can be grouped together to form a record.

Data structures are generally categorized into two classes: primitive and non-primitive data structures.

Primitive and Non-primitive Data Structures

Primitive data structures are the fundamental data types which are supported by a programming language. Some basic data types are integer, real, character, and boolean. The terms ‘data type’, ‘basic data type’, and ‘primitive data type’ are often used interchangeably.

Non-primitive data structures are those data structures which are created using primitive data structures. Examples of such data structures include linked lists, stacks, trees, and graphs.

Non-primitive data structures can further be classified into two categories: linear and non-linear data structures.

Linear Data Structure: If the elements of a data structure are stored in a linear or sequential order, then it is a linear data structure. Examples include arrays, linked lists, stacks, and queues. Linear data structures can be represented in memory in two different ways.

One way is to have to a linear relationship between elements by means of sequential memory locations. The other way is to have a linear relationship between elements by means of links.

Non Linear Data Structure: if the elements of a data structure are not stored in a sequential order, then it is a non-linear data structure. The relationship of adjacency is not maintained between elements of a non-linear data structure. Examples include trees and graphs.

Data structures are widely applied in the following areas: Compiler design , Operating system, Statistical analysis, package, DBMS, Numerical analysis, Simulation, Artificial intelligence, Graphics.

  1. Explain the various aspects of problem solving in detail. Also, discuss pros and cons of each. [7] 

Answer:

1. Solve Following
2. What is an algorithm? Explain briefly about the sequence of steps involve in designing and analysis of algorithm.
3. Explain time and space complexity of an algorithm. 10+5

Unit-II

1. Solve Following
2. What is meant by one-dimensional array? Discuss how the elements Of 1-D array are stored and access.
3. Write an algorithm to find maximum and minimum values of number stored in 2-D array. 8+7
4. Solve Following
5. What do you mean by stack? Differentiate between array and stack. Write down the procedure for implementing various stack operation.
6. What is a Queue? What are the drawbacks of linear queue? 10+5

Unit-III

1. Solve Following
2. What is a linked list? What are its applications? Explain with an example cursor implementation of linked list.
3. Write an algorithm to insert an element into a linked list. 10+5
4. Explain with suitable program segments any four operations of linked list. 15

Unit-IV

1. Solve Following
2. What do you mean by tree? Define types of tree in detail.
3. Insert the following data types in an AVL tree: 16, 23, 9, 64, 29, 73, 83, 90, 96. [8+7]
4. Solve Following
5. What do you mean by graph data structure? Explain sequential and linked list implementation of graph data structure.
6. Define the graph traversal in better ? Explain depth first search traversal . [8+7]

Unit-V

1. Write short notes on:
2. selection sort
3. Quick sort
4. Merge sort
5. Solve Following
6. Write algorithm for bubble sort. Sort the following list 73, 49, 53, 12, 48, 10, 70, 20.
7. Explain binary search tree with an example. [8+7]

Unit-I

1. Solve Following
2. what do you understand by data structure? What are the types of data structure? List out the areas in which data structure are applied extensively.
3. Explain the various aspects of problem solving in detail. Also discuss pros and cons of each.
4. Solve Following
5. What is an algorithm? Explain briefly about the sequence of steps involve in designing and analysis of algorithm.
6. Explain time and space complexity of an algorithm.

Unit-II

1. Solve Following
2. what is meant by 1-D array? Discuss how the elements of 1-D array are stored and access.
3. Write an algorithm to find maximum and Minimum values of number stored in 2-D array.
4. Write a program to find maximum and Minimum no. for following cases: -
5. for two variable
6. for three variable
7. for an array

Unit-III

1. Write a program that perform swapping in following case: -
2. using Three variable
3. using two variable
4. without any arithmetic operator
5. Describe the location of the array for 1-D, 2-D, 3-D.

Unit-IV

1. Describe asymptotic analysis of the algorithm and analysis behaviour.
2. Describe following: -
3. modular programming approach
4. top-to -down approach

Unit-V

1. Describe pointers at least (150 words)
2. Describe matrix using array data structure and perform addition of two matrices.

(MCA) UOK DSA

Unit – I

1. Solve Following

2. What are different types of data types available in C? What is a good programming language?

3. Define a function? What are different types of functions available in C language?

4. Solve Following

5. Define structured programming? What is a variable and its types?

6. Define a structure and a union. Write a program in C/C++ showing use of structure?

7. Solve Following

8. Explain the characteristics of an efficient program with examples?

9. What is Abstract data type? Describe its implementation and applications?

10. Solve Following

11. Write a C program to multiply two matrices?

12. Explain address arithmetic with reference to array and pointers?

13. Solve Following

14. Define Big-oh. What is usually a size measure of the input? What is the difference between best case and worst case running time?

15. How will you compute the running time of a recursive function? Explain with example?

16. Explain the justification behind the assumption that growth rate can be used to compare two programs?

17. Solve Following

18. Determine the frequency counts (i.e. the number of times a statement is executed) for all the statements in the following program fragment and hence express its time complexity using big-oh.

    For i = 1 to n do

    For j = 1 to i do For k = 1 to j do

                 x = x + 1
    

19. Describe the time and space complexity for the development of an algorithm. Give four properties of Big-O notation.

20. What is asymptotic analysis of the algorithm?

21. Solve Following

22. What do you understand by abstract data type? Explain row major ordering and column major ordering of multidimensional arrays.

23. Differential between structure and union. Give suitable example.

24. Solve Following

25. What do you understand by structured programming? Explain big oh notation of an algorithm’s time complexity measure.

26. write a program to arrange a list of names. Use array of pointers.

9.Solve Following

1. How pointers are used in C. Explain?

2. Write a program in C to add N numbers using pointers?

3. Solve Following

4. How the execution of a program is calculated? Explain through an example.
5. Write a program in ‘C’ to create a file.

6. How structure differs from union. Explain?

7. Solve Following

8. What is meant by Data Structures? Differentiate between Linear and non-linear data structures with examples.

9. Write a note on structured programming.

10. Solve Following

11. Write a C program to explain the concept of structure within a structure.
12. Write a C program using pointers to find the length of a character string.

Unit – II

1. Solve Following

2. Differentiate between arrays and linked lists with examples. Also explain the different types of linked lists?

3. Write a program using recursive function to calculate factorial of a number. Perform a dry run of the recursive function and track the stack for the function?

4. Solve Following

5. What do you understand by Data Structure? Explain different types of operation that can be performed on Data

Structures?

1. What is stack? Write PUSH and POP Operation for a stack. Convert the following affix Arithmetic expression to

postfix notation using stack.

A * (B+D)/E - F *(G+H/K)

1. Solve Following

2. Given circular queue with F (Front)=6 and R (Rear)=2 (Where F and R are the Front and Rear Pointers). Then give

   the values of R and F after each operation in the sequence- Insert, Delete, Delete, Insert, Delete, Insert and Delete.

   Assume that 4 bytes of storage are required to hold each element of the array begins at bytes 2000 in memory. Give the actual address of elements value [4][2].

3. Implement a sequential queue that can perform insert and delete functions. Compare overflow and underflow condition for sequential queue with circular queue.

4. Solve Following

5. Write an algorithm to insert an element in a circular queue.

6. What do you understand by generalized list? Implement stack using linked list.

7. Solve Following

8. Consider the following arithmetic infix expression ‘Q’ :

   Q : A + (B * C – (D / 𝐸𝐹 ) * G) * H

   By implementing the algorithm, convert the expression into its equivalent postfix expression.

9. What is doubly linked list. How is it differs from single linked list. Explain?

10. Solve Following

11. Write an algorithm to create a linked list of twenty elements.

12. A stack contains the following items

    S : 10 15 20 30

      ↑
    

    TOP

13. Write an algorithm to insert a new item 100 in the stack?

14. Solve Following

15. What is meant by doubly linked list? Write function or procedure to insert and delete a node from a doubly linked list.

16. Briefly explain the applications of a stack.

17. Solve Following

18. What is the difference between the stack and queue? How the queue is implemented? Explain.

19. Differentiate between recursive and non-recursive procedures with examples.

20. Solve Following

21. What are different types of data structures available in C/C++? Define and draw link list

22. Define an array. What are their types? Write a note on pointers?

23. Solve Following

24. What is recursion? Write a program in C/C++ using recursive function.

25. What is circular linked list? Write an algorithm for insertion of an element in a link list.

26. Solve Following

    1. Explain deletion of an element in a doubly linked list. Write algorithm also.
    2. Explain the use of stack in a recursive program.

Unit – III

1. Illustrate the different techniques of tree traversal with appropriate examples and diagrams?

2. Describe at least three applications each of tree and graph?

3. Solve Following

4. Discuss the Doubly linked list. Give and explain the algorithm for operations to perform the insertion and removal of

a node to and from the Doubly linked list?

1. How will you represent a polynomial using a linked list in memory? Explain. Also represent the following polynomial using linked list in memory :-

   P(x,y,z)

   

   =

   

   8x2y2𝑧 + 6𝑦𝑧2 + 3𝑥3𝑦𝑧 + 2𝑥𝑦3𝑧 − 5x2𝑦3 −4𝑥y2𝑧3

2. Solve Following

3. Given a linked list whose typical node consist of an INFO and LINK field. Formulate an algorithm which will count the number of nodes in the list. Also formulate an algorithm that will change the INFO field of the Kth node to the value given by ’y’?

4. What do you understand with circular linked list? Write functions to insert nodes and delete from circular linked list? Demonstrate the functions through suitable examples?

5. Solve Following

6. What is breadth first search. How is it differs from depth first search. Explain in brief.

7. From the following tree :-

Perform :

In -order traversal

Pre-order traversal

Post-order traversal

1. Solve Following
2. What is graph? What are the different representations techniques used by the graph in the computer’s memory. Explain each?
3. Describe binary search tree?
4. Explain the following in brief:
   1. Null graph.
   2. Pendant graph.
   3. Isolated vertex.
   4. Directed graph.
5. Solve Following
6. What is meant by Graph? How the graph is traversed?
7. Explain any one method of graph traversing with examples?

8. Write a note on binary search tree.

9. What is meant by tree traversal? Explain the various method of tree traversal using examples?

10. Solve Following

11. What is a binary tree? How is it drawn? Draw a binary tree for the following expression:

    (A + C) – C * (D/P).

12. What do you understand by Polish Notations? Write a note on graphs in C++.

13. Solve Following

14. What are tree traversal techniques? Write a note on files in C/C++.

15. What is a set and set theory? Write an algorithm/program for entering an element in doubly linked list.

16. Solve Following

17. Is there any difference between tree and graph? Explain BFS method traversal of suitable graph.

18. What are different operations possible in sets? Explain strictly binary tree and almost complete binary tree.

19. Insert following data in a binary search tree;

    23, 0, -11, 100, 215, 25, 6, 9, -27, 92

Traverse the tree in in-order traversal and in pre-order traversal techniques.

Unit – IV

1. Solve Following
2. Apply selection sort to a list of 10 numbers entered by the user to the C program?

3. Differentiate between merge sort and radix sort?

4. What is hashing? Describe the techniques of hashing with examples?

5. Solve Following

6. What do you understand with binary tree? Write functions to formulate the recursive algorithm for traversing a binary tree in order. Also consider the following binary tree: -

   

7. Determine the order in which the nodes will be visited if the tree traversed in following order: -

   Pre order

   Post order

   In order

8. Obtain the adjacency matrix A of the following diagraph. Find the elementary paths of length 1 and 2 from 𝑉1 and 𝑉4.Verify the results for calculating, 𝐴2, 𝐴3 and 𝐴4.

1. Explain the linked representation of a Binary tree with an example Construct the Binary Tree for the following

traversal.

In order L R F E A C D G H B I

Post order L E F C D H I B G A

1. Explain the following with examples: -

Connected Graph

Strongly Connected Graph

Unilaterally Graph

Complete Graph

1. Construct the Minimum Spanning tree for the following graph

-

1. Solve Following
2. Sort the following numbers by using quick sort (explain each step through the algorithm)
   1. 33 11 55 77 90 40 60 22
3. What is searching? Explain linear search.
4. Solve Following
5. Sort the following tables by using merge sort.
6. Table 1 : 15 35 65 90 99
7. Table 2 : 30 45 75
8. Explain through the algorithm.
9. Write an algorithm for the binary search.
10. Solve Folowing
11. What is meant by searching ? Discuss the working of binary searching technique?
12. How the efficiency of different sorting algorithms is measured? Make a comparative study of different sorting techniques?
13. Write short note on:
14. Bubble sort
15. Linear searching.
16. Solve Folllowing
17. How the binary search is implemented? Explain with examples?
18. What is meant by hashing? How is it implemented? Explain.
19. Write an algorithm for selection sort. What is hashing?
20. What is external sorting? Write a program in C/C++ for sorting elements of an array.
21. Write short notes on the following:
22. Heap sort;
23. Merger sort;
24. Command line arguments.

25. Apply bubble sort to the following list:

    23, 104, 95, 45, 64, 77, 84, 98, 123

Write the algorithm to arrange a list using heap sort.

1. State the difference between merge sort and radix sort.
2. Explain hashing with examples.
3. ​

Unit – V

1. Solve Following
2. What is dynamic memory management? Write an algorithm for first fit search?
3. What is garbage collection? How can it be optimized?
4. Solve Following
5. Write an algorithm for best fit memory allocation?
6. What is a stack and a queue? Write a note on buddy system for memory management?
7. Solve Following
8. Explain the differences among first fit, best fit, and worst fit algorithms?
9. Explain garbage creation and removal?
10. Solve Following
11. Explain buddy systems with suitable example?
12. What do you understand by bit map method? Where it is applicable?
13. What do you understand by Dynamic Memory Allocation? Explain with examples?
14. Solve Following
15. What is data compaction? How is it carried out?
16. Explain the concepts of garbage collection? What are its advantages?
17. Solve Following
18. What is Binary search? Apply Binary Search to search the
    1. ITEM = 40 and
    2. ITEM = 85 in the following array and determine whether search is successful or not- 11, 22, 30, 33, 40, 44, 55, 60, 66, 77, 80, 88, 99.
19. Explain the algorithm of insertion sort. Arrange the elements of following array in ascending order using insertion sort 77, 33,44,11, 88, 22, 66, 55.
20. Compare the Execution of following sorting methods for the given array: 60, 30, 20, 15, 75, 80,5,25, 2,100
21. Quick sort
22. Radix sort
23. Bubble sort
24. Selection sort
25. Tree sort

Explain the concept of dynamic memory management?

1. Write short note on: -
2. Buddy systems
3. Data Compactions
4. Fixed Block storage.
5. write short notes:
6. Data Compaction
7. Garbage collection and buddy system.
8. Explain the following:
9. First -fit
10. Worst – fit
11. Best – fit.
12. What is meant by Dynamic Memory Management? Discuss the various techniques of Dynamic Memory Management?

==

![Roll No. .................„. 24032 B. Tech. 3^rd Sem. Electronics & Communication Engg (Branch-111) Examination — December, 2013 DATA STRUCTURE USING C 'F Scheme Paper : CSE-201-F Time : T}tree hours J Maximum Marks : 100 Before anszæring the quBtions, candidates should ensure that they have been supplied the correct and complete question paper. No complain in this regard, will be entertained after examination. Note: Attempt five questions with at least one question from each section. Question No. 1 is compulsory. All questions carry equal marks. 1. Explain the following briefly: (a) Big-Oh Notation (b) Pointer to an Array © Dequeues (d) Types of Data Structures (e) Array of Structures (13)

![Roll No.. 24032 B. Tech. 3^rd Sem. (Elec. & Comm. Engg.) Examination — December, 2012 DATA STRUCTURE USING •C Paper : CSE-201-F Time : Three hours J Maximum Marks : 100 Before answering the questions, candidates should ensure that they have been supplied the correct and complete question paper. No complain in this regard, will be entertained after examination. Note : Attempt any five questions by selecting at least one question from each Unit and Q. No. 1 is compulsory. All questions carry equal marks. 1. Write Short Notes on : (a) Priority Queues (b) Dynamic Allocation © Tree Reversal (d) File organization (12) 20

![Roll No. ..... ... .... 2006 B. E. 3^rd Semester (ECE) Examination = December, 2012 DATA STRUCTURE & ALGORITH" Paper : CSE-201-E Time : Three hours J Maximum Marks : 100 Before answering the questions, candidates s}vuld ensure Out they have been supplied the,correct and compleie question paper. No complain in this regard, will be entertained after examination. Note : Attempt any five questions. All questions carry equal marks. 1. (a) What do you mean by the term Data Structure? Discuss the basic operation of data structures 10 With examples. (b) What is a stack ? How do you-represent a stack in computer memory ? Also discuss basic operations 10 performed on a stack. 2. (a) Differentiate between prefix, pcstfix -and infix expression. Also discuss significance of postfix expression. (12) 10

![Roll No. ............... 67061 MCA Regular 2^nd Semester Examination — May, 2012 DATA STRUCTURES Paper : MCA-201 Time : Ihree hours J Maximum Marks : 80 Bdore artsuering the questions, amdiåites should ensure that they supplied the Correct and complete question NO complaint in this regard, will be entertained after examination. Note : Attempt five questions in all, selecting at least one from each Unit. All questions carry equal marks. UNIT -1 1. (a) What is the importance of an algorithm in solving problems ? What characteristics are necessary for a sequence Of Steps to qualify as an algorithm ? (b) Trace out the steps of an algorithm to find the sum of following series : ⅔ ! + ⅘ ! + 6/7 ! (upton terms) 2. (a) Describe how an algorithm is analyzed in order to identify its efficiency. 67061-1

![Roll No. ............. .... 24032 B. Tech. 3^rd Sem. Electronics & Communication Engg. (Branch — Ill) Examination — December, 2011 DATA STRUCTURE USING •C• Paper : CSE-201-F Time : Three hours J Maximum Marks : 100 Before answering the qußtions, candidates should ensure that they have been supplied the correct and complete question paper. No complaint in this regard, will be entertained after examination. Note : Attempt any five questions. 1. (a) What do you mean by sparse matrices? Give a suitable data structure uses minimum storage to efficiently store a Sparse matrix in memory. 10 (b) What is an array ? Discuss the various operations eut are allowed on array data structure. I>scribe the formula for calculating the address of any element of a two dimensional array. 10

![2. (a) Write a non recursive algorithm for reversal of a string of integers. 10 (b) Write a program that takes two linked lists pointed by List-I and List-2. Write a program that concatenates the two lists in such a manner that the final list is pointed by the pointer called LIST-I 10 3. (a) Describe bubble sort algorithm and trace the steps of bubble sort for sorting the list - 12, 19, 33, 26, 29, 35, 22. Find the total number of comparison made. 10 (b) What is a deque ? Write a program that implements a deque ? 10 4. (a) Write an algorithm of complexity O(n) to find the kth smallest element in an array numnl, where n and k are given as input. 10 (b) Explain Binary search algorithm and compare it with linear search algorithm. (2) 10

![Roll No. . 2006 B. E. 3^rd Semester (ECE) Examination — December, 2011 DATA STRUCTURE & ALGORITHM Paper : CSE-201-E Time : Three hours J Maximum Marks : 100 Before answering the question, candidates should ensure that they have been supplied the correct and complete question paper. No complain in this regard, will be entertained after examination. Note : Attempt any five questions. All questions carry equal marks. 1. (a) What is a data structure ? Explain the different operations to be performed on data structures. (b) What is stack ? Describe its linked list based implementation. 2. (a) V%at are priority queues ? Discuss different implementation schemes for priority queues. Also write its different application.

![Roll No. .. 67051 MCA (Regular) 2^nd Semester (New) Examination — May, 2011 DATA STRUCTURES Paper : MCA-201 Time : Three hours I Maximum Marks : 75 Before ansu,ering the questions, candidates should ensure that they have been supplied the correct and complete question paper. No complaint in this regard, will be after examination. Note : Attempt five questions in all selecting at least one question' from each Unit. All questions carry equal marks. UNIT -l 1. What do you understand by time and space complexity Of algorithrns ? Write a detailed note. 2. Differentiate between top-down and bottom-up approach to algorithm design. Use suitable examples. UNIT - Il 3. Define, queue, circular queue, priority queue, and D- queue. For a circular queue with an implementation in array, write functions for:

![Ron No.. 2006 B. E. 3^rd Semester (ECE) Examination — December, 2009 DATA STRUCTURE & ALGORITHM Paper : CSE-201-E Time : I"ree hours I Maximum Marks : 100 Before answering the question, candidates should ensure that they have been supplied the correct and complete question paper. No complaint in this regard, will be entertained after examination. Note : Attempt five questions. All questions carry equal marks. 1. (a) What do you mean by the term Data Structure? Discuss the basic operations of data structures with examples. 10 (b) What is a two dimensional array ? Describe the formula for calculating the address of any element of a two dimensional array. 10 2. (a) What is circular queue ? Discuss its advantages over linear queue ? 10 (b) What do you understand by Dynamic memory management ? Create a circular link list using 2006-17,

![24032 R. Tech. 3^rd Semester (IT) F. Scheme Examination, December—2014 DATA STRUCTURE USING 'C ' Paper-CSE-201-F Time allowed : 3 hours 1 Maximum marks ; 100 Note : e. No. 1 is compulsory. Attempt four questions by selecting one question from each section. All questions carry equal marks. 1. 2. (a) (b) © (d) (e) (D (a) (b) What do you mean by balanced trees ? 3 What are the difference between arrays and linked lists ? 4 What is the algorithm to find out the height of a binary tree ? 4 What are binary search trees and what is it mainly used for ? What are main three properties of heaps ? How do you define O-notation ? Section—A 3 3 3 What is mean by time and space complexity of an algorithm ? Illustrate with suitable examples. 10 Define a 'Stack' ? Explain its typical three applications. Also write code in C for PUSH and POP operation on a stack. 24032-P-3-Q-9-(14) 10 PT.O.

04